Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs
نویسندگان
چکیده
In this paper, we consider the fault Hamiltonicity, and the fault Hamiltonian connectivity of the (n, k)-star graph Sn,k. Assume that F V(Sn,k) E(Sn,k). For n k ≥ 2, we prove that Sn,k F is Hamiltonian if F ≤ n 3 and Sn,k F is Hamiltonian connected if F ≤ n 4. For n k 1, Sn,n 1 is isomorphic to the n-star graph Sn which is known to be Hamiltonian if and only if n > 2 and Hamiltonian connected if and only if n 2. Moreover, all the bounds are tight. © 2003 Wiley Periodicals, Inc.
منابع مشابه
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
Jwo et al. [Networks 23 (1993) 315–326] introduced the alternating group graph as an interconnection network topology for computing systems. They showed that the proposed structure has many advantages over n-cubes and star graphs. For example, all alternating group graphs are hamiltonian-connected (i.e., every pair of vertices in the graph are connected by a hamiltonian path) and pancyclic (i.e...
متن کاملA recursively construction scheme for super fault-tolerant hamiltonian graphs
For the interconnection network topology, it is usually represented by a graph. When a network is used, processors and/or links faults may happen. Thus, it is meaningful to consider faulty networks. We consider k-regular graphs in this paper. We define a k-regular hamiltonian and hamiltonian connected graph G is super fault-tolerant hamiltonian if G remains hamiltonian after removing at most k ...
متن کاملRing embedding in faulty pancake graphs
In this paper, we consider the fault hamiltonicity and the fault hamiltonian connectivity of the pancake graph Pn. Assume that F ⊆ V (Pn)∪E(Pn). For n 4, we prove that Pn−F is hamiltonian if |F | (n−3) and Pn−F is hamiltonian connected if |F | (n− 4). Moreover, all the bounds are optimal. 2003 Elsevier Science B.V. All rights reserved.
متن کاملFault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks
Many papers on the fully connected cubic networks have been published for the past several years due to its favorite properties. In this paper, we consider the fault-tolerant hamiltonian connectivity and fault-tolerant hamiltonicity of the fully connected cubic network. We use FCCNn to denote the fully connected cubic network of level n. Let G = (V, E) be a graph. The fault-tolerant hamiltonian...
متن کاملConstruction schemes for fault-tolerant Hamiltonian graphs
In this paper, we present three construction schemes for fault-tolerant Hamiltonian graphs. We show that applying these construction schemes on fault-tolerant Hamiltonian graphs generates graphs preserving the original Hamiltonicity property. We apply these construction schemes to generate some known families of optimal 1-Hamiltonian graphs in the literature and the Hamiltonicity properties of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 42 شماره
صفحات -
تاریخ انتشار 2003